A Facility Location Formulation for Stable Polynomials and Elliptic Fekete Points
نویسنده
چکیده
A breakthrough paper written in 1993 by Shub and Smale unveiled the relationship between stable polynomials and points which minimize the discrete logarithmic energy on the Riemann sphere (a.k.a. elliptic Fekete points). This relationship has inspired advances in the study of both concepts, many of whose main properties are not well known yet. In this paper I prove an equivalent formulation for the problem of elliptic Fekete points and some consequences, including a (non-sharp) reciprocal of Shub and Smale’s result and some novel nontrivial claims about these classical problems.
منابع مشابه
Heuristic Methods Based on MINLP Formulation for Reliable Capacitated Facility Location Problems
This paper addresses a reliable facility location problem with considering facility capacity constraints. In reliable facility location problem some facilities may become unavailable from time to time. If a facility fails, its clients should refer to other facilities by paying the cost of retransfer to these facilities. Hence, the fail of facilities leads to disruptions in facility location dec...
متن کاملA two-phase free boundary problem for a semilinear elliptic equation
In this paper we study a two-phase free boundary problem for a semilinear elliptic equation on a bounded domain $Dsubset mathbb{R}^{n}$ with smooth boundary. We give some results on the growth of solutions and characterize the free boundary points in terms of homogeneous harmonic polynomials using a fundamental result of Caffarelli and Friedman regarding the representation of functions whose ...
متن کاملNew spatial clustering-based models for optimal urban facility location considering geographical obstacles
The problems of facility location and the allocation of demand points to facilities are crucial research issues in spatial data analysis and urban planning. It is very important for an organization or governments to best locate its resources and facilities and efficiently manage resources to ensure that all demand points are covered and all the needs are met. Most of the recent studies, which f...
متن کاملEvaluating the Effectiveness of Integrated Benders Decomposition Algorithm and Epsilon Constraint Method for Multi-Objective Facility Location Problem under Demand Uncertainty
One of the most challenging issues in multi-objective problems is finding Pareto optimal points. This paper describes an algorithm based on Benders Decomposition Algorithm (BDA) which tries to find Pareto solutions. For this aim, a multi-objective facility location allocation model is proposed. In this case, an integrated BDA and epsilon constraint method are proposed and it is shown that how P...
متن کاملOn the facility location problem: One-round weighted Voronoi game
Voronoi game presents a simple geometric model for Competitive facility location problems with two players. Voronoi game is played by two players known as White and Black, they play in a continuous arena. In the one-round game, White starts game and places all his points in the arena then Black places her points. Then the arena is divided by distance between two players and the player with the ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Foundations of Computational Mathematics
دوره 15 شماره
صفحات -
تاریخ انتشار 2015